Structure Optimization for Large Gene Networks Based on Greedy Strategy
نویسندگان
چکیده
منابع مشابه
Deprecation based greedy strategy for target set selection in large scale social networks
The problem of target set selection for large scale social networks is addressed in the paper. We describe a novel deprecation based greedy strategy to be applied over a pre-ordered (as obtained with any heuristic influence function) set of nodes. The proposed algorithm runs in iteration and has two stages, (i) Estimation: where the performance of each node is evaluated and (ii) Marking: where ...
متن کاملOptimization of conditions for gene delivery system based on PEI
Objective(s): PEI based nanoparticle (NP) due to dual capabilities of proton sponge and DNA binding is known as powerful tool for nucleic acid delivery to cells. However, serious cytotoxicity and complicated conditions, which govern NPs properties and its interactions with cells practically, hindered achievement to high transfection efficiency. Here, we have tried to optimize the properties of ...
متن کاملGenetic Algorithm with Directional Mutation Based on Greedy Strategy for Large-scale 0-1 Knapsack Problems
In view of the lack of efficiency or accuracy of solving large-scale 0-1 knapsack problems by the classic genetic algorithm, a directional mutation operator is designed to reduce the probability of resampling in the search process. Meanwhile an initializing operator and an individual correction operator are added to the algorithm to modify individual after every amendment, both of which are com...
متن کاملGreedy Structure Search for Sum-Product Networks
Sum-product networks (SPNs) are rooted, directed acyclic graphs (DAGs) of sum and product nodes with well-defined probabilistic semantics. Moreover, exact inference in the distribution represented by an SPN is guaranteed to take linear time in the size of the DAG. In this paper we introduce an algorithm that learns the structure of an SPN using a greedy search approach. It incorporates methods ...
متن کاملGreedy optimization classifiers ensemble based on diversity
Decreasing the individual error and increasing the diversity among classifiers are two crucial factors for improving ensemble performances. Nevertheless, the ‘‘kappa-error’’ diagram shows that enhancing the diversity is at the expense of reducing individual accuracy. Hence, a newmethod namedMatching Pursuit Optimization Ensemble Classifiers (MPOEC) is proposed in this paper in order to balance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Mathematical Methods in Medicine
سال: 2018
ISSN: 1748-670X,1748-6718
DOI: 10.1155/2018/9674108